An Algorithm for Group Formation in an Amorphous Computer

Amorphous computing is the study of programming ultra scale computing environments of smart sensors and actuators that communicate locally via wireless broadcast In such environments where individual el ements have limited resources aggregation into groups is useful for specialization fault tolerance and re source allocation This paper presents a new algo rithm called clubs that takes advantage of the local communication to e ciently aggregate processors into groups in an amorphous computer Time taken is pro portional to the local density of processors even in an asynchronous setting The physical embedding of the amorphous computer is used to derive an upper bound on the number and density of groups formed The clubs algorithm can be extended to adapt to pro cessor failures and to nd the maximal independent set MIS and vertex coloring in O logN rounds where N is the total number of elements and is the maximum degree Simulation results and example ap plications are presented